The simplest form of hill climbing search is 'forgetful', that is at each step one moves to an adjoining or close point with a better (or best) fitness function. The is has the dabger of getting stuck as a local maxima or reach an impasse if some states are not allowed, for example those thart are not feasible when there are {[constraints}}. For this reason, variants of hill climbing may searches keep track of past states (memory) and use backtracking to reisit them in case of impasse, or to explore alternatives suhc as anext best solution.
Used on page 75
Also known as forgetful